Efficient lattice assessment for LCG and GLP parameter searches
نویسندگان
چکیده
منابع مشابه
Efficient lattice assessment for LCG and GLP parameter searches
In the present paper we show how to speed up lattice parameter searches for Monte Carlo and quasi–Monte Carlo node sets. The classical measure for such parameter searches is the spectral test which is based on a calculation of the shortest nonzero vector in a lattice. Instead of the shortest vector we apply an approximation given by the LLL algorithm for lattice basis reduction. We empirically ...
متن کاملTemplate-based searches for gravitational waves: efficient lattice covering of flat parameter spaces
The construction of optimal template banks for matched-filtering searches is an example of the sphere covering problem. For parameter spaces with constant-coefficient metrics a (near-) optimal template bank is achieved by the A∗n lattice, which is the best lattice-covering in dimensions n ≤ 5, and is close to the best covering known for dimensions n ≤ 16. Generally this provides a substantially...
متن کاملdiagnostic and developmental potentials of dynamic assessment for writing skill
این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...
15 صفحه اولEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کاملResource Allocation for Steerable Parallel Parameter Searches
Computational Grids lend themselves well to parameter sweep applications, which consist of independent tasks, each of which calculates results for a separate point in parameter space. However, it is possible for a parameter space to become so large as to pose prohibitive system requirements. In these cases, user-directed steering promises to reduce overall computation time. In this paper, we ad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2001
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-01-01415-6